The Richardson Extrapolation Process with a Harmonic Sequence of Collocation Points
نویسنده
چکیده
Let A(y) ∼ A+ ∑∞ k=1 αky σk as y → 0+, where y is a discrete or continuous variable. Assume that σk are known numbers that may be complex in general and that A(y) is known for y ∈ (0, b] for some b > 0. The aim is to find or approximate A, the limit or antilimit of A(y) as y → 0+. One very effective way of approximating A is by the Richardson extrapolation process that is defined via the linear systems A(yl) = A (j) n + ∑n k=1 αky σk l , j ≤ l ≤ j + n. Here A n are approximations to A and αk are additional unknowns. The yl are picked such that y0 > y1 > y2 > · · · > 0 and liml→∞ yl = 0. In this paper we give a detailed analysis of the convergence and stability of the column sequences {A n } ∞ j=0 with n fixed, when yl = c/(l + η) q for some positive c, η, and q. Specifically, we prove that convergence takes place as j → ∞ and give the precise rate at which it does. We also prove that the process is unstable and quantify its instability asymptotically. This instability may be dealt with numerically by using high-precision floating-point arithmetic.
منابع مشابه
New convergence results on the generalized Richardson extrapolation process GREP for logarithmic sequences
approximations A (j) n to A obtained via GREP(1) are defined by the linear systems a(tl) = A (j) n + φ(tl) ∑n−1 i=0 β̄it i l , l = j, j + 1, . . . , j + n, where {tl}l=0 is a decreasing positive sequence with limit zero. The study of GREP(1) for slowly varying functions a(t) was begun in two recent papers by the author. For such a(t) we have φ(t) ∼ αtδ as t → 0+ with δ possibly complex and δ 6= ...
متن کاملRichardson Extrapolation Applied to the Numerical Solution of Boundary Integral Equations for a Laplace’s Equation Dirichlet Problem
Richardson extrapolation is applied to improve the accuracy of the numerical solution of boundary integral equations. The boundary integral equations arise from a direct boundary integral method for solving a Laplace’s equation interior Dirichlet problem. Specifically, the Richardson extrapolation is used to improve the accuracy of collocation. Numerical justification is provided to support the...
متن کاملFast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
In the present paper we present the tensor-product approximation of multidimensional convolution transform discretized via collocation-projection scheme on the uniform or composite refined grids. Examples of convolving kernels are given by the classical Newton, Slater (exponential) and Yukawa potentials, 1/‖x‖, e−λ‖x‖ and e−λ‖x‖/‖x‖ with x ∈ Rd. For piecewise constant elements on the uniform gr...
متن کاملNumerical Algorithms 0 ( 1998 ) ? { ? 1 On the Stability of the
The stability of a large class of nonlinear sequence transformations is analyzed. of the convergence behavior of the J transformation. Similar to recent results of Sidi, it is proved that the pJ transformations , the Weniger S transformation, the Levin transformation and a special case of the Generalized Richardson Extrapolation Process of Sidi are S-stable. An eecient algorithm for the calcula...
متن کاملEfficient implementation of stable Richardson Extrapolation algorithms
Richardson Extrapolation is a powerful computational tool which can successfully be used in the efforts to improve the accuracy of the approximate solutions of systems of ordinary differential equations (ODEs) obtained by different numerical methods (including here combined numerical methods consisting of appropriately chosen splitting procedures and classical numerical methods). Some stability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 37 شماره
صفحات -
تاریخ انتشار 2000